Strong products of hypergraphs: Unique prime factorization theorems and algorithms
نویسندگان
چکیده
منابع مشابه
Strong Products of Hypergraphs: Unique Prime Factorization Theorems and Algorithms
It is well-known that all finite connected graphs have a unique prime factor decomposition (PFD) with respect to the strong graph product which can be computed in polynomial time. Essential for the PFD computation is the construction of the so-called Cartesian skeleton of the graphs under investigation. In this contribution, we show that every connected thin hypergraph H has a unique prime fact...
متن کاملLocal Algorithms for the Prime Factorization of Strong Product Graphs
The practical application of graph prime factorization algorithms is limited in practice by unavoidable noise in the data. A first step towards error-tolerant “approximate” prime factorization, is the development of local approaches that cover the graph by factorizable patches and then use this information to derive global factors. We present here a local, quasi-linear algorithm for the prime f...
متن کاملFactorization of Cartesian Products of Hypergraphs
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...
متن کاملFast Factorization of Cartesian products of Hypergraphs
Cartesian products of graphs and hypergraphs have been studied since the 1960s. For (un)directed hypergraphs, unique prime factor decomposition (PFD) results with respect to the Cartesian product are known. However, there is still a lack of algorithms, that compute the PFD of directed hypergraphs with respect to the Cartesian product. In this contribution, we focus on the algorithmic aspects fo...
متن کاملInterchange Theorems for Hypergraphs and Factorization of Their Degree Sequences
The aim of this paper is to unify interchange theorems and extend them to hypergraphs. To this end sufficient conditions for equality of the l1-distance between equivalence classes and the l1-distance between corresponding order-type functions are provided. The generality of this result is demonstrated by a number of new corollaries concerning the factorization and the switching completeness of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2014
ISSN: 0166-218X
DOI: 10.1016/j.dam.2014.02.017